On minimum circumscribed polygons
نویسندگان
چکیده
منابع مشابه
Numerical range circumscribed by two polygons
We show that, for any 2n+ 2 distinct points a1, a′ 1, a2, a′ 2, . . . , an+1, a′ n+1 (in this order) on the unit circle, there is an n-by-n matrix A, unique up to unitary equivalence, which has norm one and satisfies the conditions that it has all its eigenvalues in the open unit disc, In − A∗A has rank one and its numerical range is circumscribed by the two (n+ 1)-gons a1a2 · · · an+1 and a′ 1...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملMinimum Hidden Guarding of Histogram Polygons
A hidden guard set G is a set of point guards in polygon P that all points of the polygon are visible from some guards in G under the constraint that no two guards may see each other. In this paper, we consider the problem for finding minimum hidden guard sets in histogram polygons under orthogonal visibility. Two points p and q are orthogonally visible if the orthogonal bounding rectangle for ...
متن کاملMinimum Rectilinear Polygons for Given Angle Sequences
In this paper, we consider the problem of computing, for a given rectilinear angle sequence, a “small” rectilinear polygon. A rectilinear angle sequence S is a sequence of left (90◦) turns and right (270◦) turns, that is, S = (s1, . . . , sn) ∈ {L, R}, where n is the length of S. As we consider only rectilinear angle sequences, we usually drop the term “rectilinear.” A polygon P realizes an ang...
متن کاملMinimum-Length Polygons in Approximation Sausages
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a minimum-length polygon in this approximating sausage. The length of the polygon is taken as an estimator for the length of the curve being the (unknown) preimage of the given digital curve. Assuming finer and finer grid resolu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1944
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1944-08096-8